On Learning from Queries and Counterexamples in the Presence of Noise
نویسنده
چکیده
Sakakibara, Y., On learning from queries and counterexamples in the presence of noise, Information Processing Letters 37 (1991) 279-284. Recently Angluin and Laird have introduced the classification noise process in the Valiant leamability model and proposed an interesting problem to explore the effect of noise in a situation that calls for queries as well as random sampling. In this paper, we present a general method to modify a polynomial-time learning algorithm from a sampling oracle and membership queries to compensate for random errors in the sampling and query responses.
منابع مشابه
An Effective Approach for Robust Metric Learning in the Presence of Label Noise
Many algorithms in machine learning, pattern recognition, and data mining are based on a similarity/distance measure. For example, the kNN classifier and clustering algorithms such as k-means require a similarity/distance function. Also, in Content-Based Information Retrieval (CBIR) systems, we need to rank the retrieved objects based on the similarity to the query. As generic measures such as ...
متن کاملThe effects of traffic noise on memory and auditory-verbal learning in Persian language children
Background: Acoustic noise is one of the universal pollutants of modern society. Although the high level of noise adverse effects on human hearing has been known for many years, non-auditory effects of noise such as effects on cognition, learning, memory and reading, especially on children, have been less considered. Factors which have negative impact on these features can also have a negat...
متن کاملAdaptive Filtering Strategy to Remove Noise from ECG Signals Using Wavelet Transform and Deep Learning
Introduction: Electrocardiogram (ECG) is a method to measure the electrical activity of the heart which is performed by placing electrodes on the surface of the body. Physicians use observation tools to detect and diagnose heart diseases, the same is performed on ECG signals by cardiologists. In particular, heart diseases are recognized by examining the graphic representation of heart signals w...
متن کاملPolynomial Time Learnability of Simple Deterministic Languages from MAT and a Representative Sample
We propose a learning algorithm for simple deterministic languages from queries and a priori knowledge. To the learner, a special finite subset of the target language, called a representative sample, is provided at the beginning and two types of queries, equivalence queries and membership queries, are available. This learning algorithm constructs nonterminals of a hypothesis grammar based on Is...
متن کاملLearning Languages from Positive Data and a Finite Number of Queries
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, superset, and subset queries are considered (for the latter one we consider also a variant when the learner tests every conjecture, but the number of negative answers is uniformly bounded). If the answer is negative, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 37 شماره
صفحات -
تاریخ انتشار 1991